Characterizing intersection classes of graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On cycles in intersection graphs of rings

‎Let $R$ be a commutative ring with non-zero identity. ‎We describe all $C_3$‎- ‎and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. ‎Also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎Finally, ‎we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...

متن کامل

Refining the Hierarchies of Classes of Geometric Intersection Graphs

We analyse properties of geometric intersection graphs to show strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties: • A graph G is outerplanar if and only if the 1-subdivision of G is outer-segment. • For each integer k > 1, the class of intersection graphs of segments with k different lengths is a strict subclass of ...

متن کامل

Measuring the Vulnerability for Classes of Intersection Graphs

A general method for the computation of various parameters measuring the vulnerability of a graph is introduced. Four measures of vulnerability are considered, i.e., the toughness, scattering number, vertex integrity and the size of a minimum balanced separator. We show how to compute these parameters by polynomial time algorithms for various classes of intersection graphs like permutation grap...

متن کامل

Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs

We show that the class of unit grid intersection graphs properly includes both of the classes of interval bigraphs and of P6-free chordal bipartite graphs. We also demonstrate that the classes of unit grid intersection graphs and of chordal bipartite graphs are incomparable. © 2007 Elsevier B.V. All rights reserved.

متن کامل

Intersection graphs associated with semigroup acts

The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1985

ISSN: 0012-365X

DOI: 10.1016/0012-365x(85)90047-0